Consensus When All Processes May Be Byzantine for Some Time
نویسندگان
چکیده
Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process at which a value fault occurs is forever “stigmatized” as being Byzantine, an assumption that might not be acceptable for long-lived systems, where processes need to be reintegrated after a fault. We thus consider a model where Byzantine processes can recover in a predefined recovery state, and show that consensus can be solved in such a model.
منابع مشابه
Brief Announcement: A Leader-free Byzantine Consensus Algorithm
We consider the consensus problem in a partially synchronous system with Byzantine faults. In a distributed system of n processes, where each process has an initial value, Byzantine consensus is the problem of agreeing on a common value, even though some of the processes may fail in arbitrary, even malicious, ways. It is shown in [11] that — in a synchronous system — 3t + 1 processes are needed...
متن کاملCas Cs 537 :
Distributed computing often involves a set of n processes arriving at a consensus/agreement on some bit v, in a de-centralized fashion. The problem is particularly interesting in the presence of Byzantine failures, i.e., an adversary may adaptively corrupt upto t among these n processes and cause them to behave arbitrarily in the consensus protocol. To elaborate, these processes may either comp...
متن کاملRelaxed Byzantine Vector Consensus
Byzantine vector consensus requires that non-faulty processes reach agreement on a decision (or output) that is in the convex hull of the inputs at the non-faulty processes. Recent work has shown that, for n processes with up to f Byzantine failures, when the inputs are d-dimensional vectors of reals, n ≥ max (3f + 1, (d+ 1)f + 1) is the tight bound for synchronous systems, and n ≥ (d+ 2)f + 1 ...
متن کاملAsynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, O(1) Time, and no Signature
This paper presents a new algorithm that reduces multivalued consensus to binary consensus in an asynchronous message-passing system made up of n processes where up to t may commit Byzantine failures. This algorithm has the following noteworthy properties: it assumes t < n/3 (and is consequently optimal from a resilience point of view), uses O(n) messages, has a constant time complexity, and do...
متن کاملTime-Free and Timer-Based Assumptions Can Be Combined to Solve Authenticated Byzantine Consensus
To circumvent the FLP impossibility result in a deterministic way several protocols have been proposed on top of an asynchronous distributed system enriched with additional assumptions. In the context of Byzantine failures for systems where at most t processes may exhibit a Byzantine behavior, two approaches have been investigated to solve the consensus problem.The first, relies on the addition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2009